Effective All-Pairs Dijkstra’s Algorithm for Computing Undirected Weighted Graph Metrics
نویسنده
چکیده
The graph metric of an undirected graph can be represented by a symmetric matrix in which each entry is the graph distance between the corresponding nodes, i.e., the shortest path distance between them. This article presents an improved all-pairs Dijkstra’s algorithm for computing the graph metric on an undirected weighted graph. Taking the advantage of the symmetric property of the graph metric, the developed algorithm avoids the repeated computations in the construction of shortest path tree that produces the metric, so that it saves about a half computing time as compared with the regular all-pairs Dijkstra’s algorithm.
منابع مشابه
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
We present a new scheme for computing shortest paths on real-weighted undirected graphs in the fundamental comparison-addition model. In an efficient preprocessing phase our algorithm creates a linear-size structure that facilitates single-source shortest path computations in O(m logα) time, where α = α(m,n) is the very slowly growing inverse-Ackermann function, m the number of edges, and n the...
متن کاملRecursive Shortest Path Algorithm with Application to Density-integration of Weighted Graphs
Graph theory is increasingly commonly utilised in genetics, proteomics and neuroimaging. In such fields, the data of interest generally constitute weighted graphs. Analysis of such weighted graphs often require the integration of topological metrics with respect to the density of the graph. Here, density refers to the proportion of the number of edges present in that graph. When topological met...
متن کاملExperimental Evaluation of a New Shortest Path Algorithm
We evaluate the practical efficiency of a new shortest path algorithm for undirected graphs which was developed by the first two authors. This algorithm works on the fundamental comparison-addition model. Theoretically, this new algorithm out-performs Dijkstra’s algorithm on sparse graphs for the all-pairs shortest path problem, and more generally, for the problem of computing single-source sho...
متن کاملFaster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate δ̂(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ δ̂(u, v) ≤ t · δ(u, v). Computing distances of small stretch efficiently (both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel and versatile scheme for all...
متن کاملComputing the diameter polynomially faster than APSP
We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in Õ(Mn 2+3)/(ω+1)) time, where ω < 2.376 is the exponent of fast matrix multiplication, n is the number of vertices of the graph, and the edge weights are integers in {−M, . . . , 0, . . . ,M}. For bounded integer weights the running time is O(n) and if ω = 2+ o(1) it is Õ(n). This...
متن کامل